Tree decomposition - PDFSEARCH.IO - Document Search Engine

Tree decomposition
Results: 411

#	Item
161	Monotonicity testing over general poset domains [Extended Abstract] Eldar Fischer Eric Lehman Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2004-02-03 12:29:43 Bipartite graph Tree decomposition Graph Aanderaa–Karp–Rosenberg conjecture Edge coloring Graph theory Mathematics Clique
162	Left and right convergence of graphs with bounded degree Christian Borgs, Jennifer Chayes, Jeff Kahn∗, L´aszl´o Lov´asz† (January 31, 2010) Contents 1 Introduction Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2010-06-24 13:34:21 Intersection graph Graph Tree Line graph Tree decomposition Graph theory Mathematics Directed graph
163	Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-04-18 22:07:45 Connected component SPQR tree Biconnected graph Directed acyclic graph Series-parallel graph Reachability Tree decomposition Tree K-vertex-connected graph Graph theory Graph connectivity Biconnected component
164	k-Cographs are Kruskalian Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-16 14:46:21 Distance-hereditary graph Neighbourhood Clique Minor Induced path Graph coloring Graph Tree Path decomposition Graph theory Graph operations Cograph
165	Longest Paths in Planar DAGs in Unambiguous Log-Space Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:29:35 Directed acyclic graph Shortest path problem Graph coloring Planarity testing Tree Matroid theory Path decomposition Chromatic polynomial Graph theory Planar graphs Network theory
166	Constraint Design Rewriting Roberto Brunia , Alberto Lluch Lafuenteb , Ugo Montanaria a Dipartimento di Informatica, Universit`a di Pisa, Italy { bruni,ugo}@ di. unipi. it Add to Reading List Source URL: dl.dropboxusercontent.com Language: English Local consistency Flow network Graph Constraint satisfaction Constraint logic programming Directed graph Decomposition method Tree decomposition Graph theory Constraint programming Theoretical computer science
167	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
168	Data Structure Fusion Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard, and Mooly Sagiv Stanford University, AT&T Labs Research, MIT, Tel Aviv University Abstract. We consider the problem of specifying data stru Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-09-10 20:45:48 Mathematics Data modeling SQL Relational algebra Extension Tree decomposition Finitary relation Relation Table Graph theory Data management Relational model
169	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
170	Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗ Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2013-10-25 09:59:52 Chordal graph Clique Maximal independent set Split graph Tree decomposition Cograph Independent set Neighbourhood Clique-sum Graph theory Graph operations NP-complete problems

UPDATE